Near-Optimal Signal Detection Based on the MMSE Detection Using Multi-Dimensional Search for Correlated MIMO Channels
نویسندگان
چکیده
This paper proposes a low-complexity signal detection algorithm for spatially correlated multiple-input multiple-output (MIMO) channels. The proposed algorithm sets a minimum mean-square error (MMSE) detection result to the starting point, and searches for signal candidates in multi-dimensions of the noise enhancement from which the MMSE detection suffers. The multi-dimensional search is needed because the number of dominant directions of the noise enhancement is likely to be more than one over the correlated MIMO channels. To reduce the computational complexity of the multi-dimensional search, the proposed algorithm limits the number of signal candidates to O(NT ) where NT is the number of transmit antennas and O( ) is big O notation. Specifically, the signal candidates, which are unquantized, are obtained as the solution of a minimization problem under a constraint that a stream of the candidates should be equal to a constellation point. Finally, the detected signal is selected from hard decisions of both the MMSE detection result and unquantized signal candidates on the basis of the log likelihood function. For reducing the complexity of this process, the proposed algorithm decreases the number of calculations of the log likelihood functions for the quantized signal candidates. Computer simulations under a correlated MIMO channel condition demonstrate that the proposed scheme provides an excellent trade-off between BER performance and complexity, and that it is superior to conventional one-dimensional search algorithms in BER performance while requiring less complexity than the conventional algorithms. key words: correlated MIMO channel, signal detection, low complexity, MMSE, noise enhancement, multi-dimensional search
منابع مشابه
Low-complexity near-optimal signal detection for uplink large-scale MIMO systems
ELECT The minimum mean square error (MMSE) signal detection algorithm is near-optimal for uplink multi-user large-scale multiple-input–multiple-output (MIMO) systems, but involves matrix inversion with high complexity. It is firstly proved that the MMSE filtering matrix for large-scale MIMO is symmetric positive definite, based on which a low-complexity near-optimal signal detection algorithm b...
متن کاملNear-ML Signal Detection in Large-Dimension Linear Vector Channels Using Reactive Tabu Search
Low-complexity near-optimal signal detection in large dimensional communication systems is a challenge. In this paper, we present a reactive tabu search (RTS) algorithm, a heuristic based combinatorial optimization technique, to achieve low-complexity near-maximum likelihood (ML) signal detection in linear vector channels with large dimensions. Two practically important large-dimension linear v...
متن کاملA Soft-Input Soft-Output Target Detection Algorithm for Passive Radar
Abstract: This paper proposes a novel scheme for multi-static passive radar processing, based on soft-input soft-output processing and Bayesian sparse estimation. In this scheme, each receiver estimates the probability of target presence based on its received signal and the prior information received from a central processor. The resulting posterior target probabilities are transmitted to the c...
متن کاملApproximate ML Detection Based on MMSE for MIMO Systems
We derive two types of approximate maximum likelihood (ML) detection based on minimum mean squared error (MMSE), MMSE-CML (conditional ML) detection and MMSECLML (conditional local ML) detection, for MIMO communication system. A simple reliability judge rule to judge the estimate of the transmit symbols is also given. For the proposed MMSECML detection, received signals are first sent into MMSE...
متن کاملLow-Complexity Soft-Output Signal Detection Based on Gauss-Seidel Method for Uplink Multi-User Large-Scale MIMO Systems
For uplink large-scale MIMO systems, minimum mean square error (MMSE) algorithm is near-optimal but involves matrix inversion with high complexity. In this paper, we propose to exploit the Gauss-Seidel (GS) method to iteratively realize the MMSE algorithm without the complicated matrix inversion. To further accelerate the convergence rate and reduce the complexity, we propose a diagonal-approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 94-B شماره
صفحات -
تاریخ انتشار 2011